Line Digraphs and Coined Quantum Random Walks

نویسنده

  • SIMONE SEVERINI
چکیده

In this note, we give a characterization of the adjacency matrix of the line digraph of a regular digraph and we discuss a generalization.On the light of the characterization given, we remark that the underlying digraph of a coined quantum random walk is the line digraph of a regular digraph. 1. A characterization of the adjacency matrix of the line digraph of a regular digraph 1.1. Set-up. The notion of line digraph has been introduced by Harary and Norman [HN60] in 1960. A classic survey on line graphs and digraphs is [HB78]; a recent one is [P95]. Line digraphs are used in the design and analysis of interconnection networks (see e.g. [FYA84]). Line digraphs are also used in algorithms for DIRECTED MAX-CUT [CE90] and TRAVELLING SALESMAN [GKWS98]. Definition 1 (Line digraph). The line digraph −→ LD of a digraph D = (V,A) is the digraph whose vertex set is A (D), and ((vi, vj) , (vk, vl)) ∈ A (−→ LD ) if and only if vj = vk, where vi, vj , vk, vl ∈ V (D) and (vi, vj) , (vk, vl) ∈ A (D). Iteratively, −→ L D = −→ L k−1 −→ LD, and −→ L D is called k-line digraph of D. Example 1. Let denote byKd the complete symmetric digraph. Let denote byK + d the complete symmetric digraph with a loop at each vertex. The de Bruijn digraph B (d, k) and the Kautz digraph K (d, k) can be defined as follows (see [FYA84]): B (d, k) = −→ L Kd and K (d, k) = −→ L K d . We remark that the line digraph of an Eulerian digraph is: • Hamiltonian (see e.g. [HB78]); • The pattern of a unitary matrix (see [S02]), that is, there are unitary matrices such that their ij-th entry is nonzero, if and only if (vi, vj) is an arc. It might be interesting to remark that: • If D is strong, k-regular and on n-vertices, then −→ LD is strong, k-regular, and on n · k vertices (see e.g. [HB78], Theorem 7.4). • The eigenvalues of −→ LD are the eigenvalues of D plus a zero eigenvalue with algebraic multiplicity n (k − 1) (see e.g. [R01], Theorem 3); Date: September 2002. 1991 Mathematics Subject Classification. Primary 05C50.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Digraph of a Unitary Matrix

Given a matrix M of size n, the digraph D on n vertices is said to be the digraph of M , when Mij 6= 0 if and only if (vi, vj) is an arc of D. We give a necessary condition, called strong quadrangularity, for a digraph to be the digraph of a unitary matrix. With the use of such a condition, we show that a line digraph, − → L D, is the digraph of a unitary matrix if and only if D is Eulerian. It...

متن کامل

Quantum random walk search on satisfiability problems

Using numerical simulation, we measured the performance of several potential quantum algorithms, based on quantum random walks, to solve Boolean satisfiability (SAT) problems. We develop the fundamentals of quantum computing and the theory of classical algorithms to indicate how these algorithms could be implemented. We also discuss the development of quantum random walks and the principles tha...

متن کامل

Convergence of coined quantum walks on R

Coined quantum walks may be interpreted as the motion in position space of a quantum particle with a spin degree of freedom; the dynamics are determined by iterating a unitary transformation which is the product of a spin transformation and a translation conditional on the spin state. Coined quantum walks on Z can be treated as special cases of coined quantum walks on R. We study quantum walks ...

متن کامل

Quantum Walks

Quantum walks can be considered as a generalized version of the classical random walk. There are two classes of quantum walks, that is, the discrete-time (or coined) and the continuous-time quantum walks. This manuscript treats the discrete case in Part I and continuous case in Part II, respectively. Most of the contents are based on our results. Furthermore, papers on quantum walks are listed ...

متن کامل

Quantum walks based on an interferometric analogy

There are presently two models for quantum walks on graphs. The “coined” walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the particle will move. The continuous walks operate with continuous time. Here a third model for quatum walks is proposed, which is based on an analogy to optical int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002